Markup fixes.

        * gdk-pixbuf/tmpl/creating.sgml,
        gdk-pixbuf/tmpl/gdk-pixbuf-xlib-from-drawables.sgml,
        gdk-pixbuf/tmpl/gdk-pixbuf-xlib-init.sgml,
        gdk-pixbuf/tmpl/gdk-pixbuf-xlib-rendering.sgml,
        gdk-pixbuf/tmpl/refcounting.sgml: Markup fixes.

        * gtk/building.sgml, gtk/resources.sgml: Markup fixes.

        * gtk/gtk.types: Remove gtk_text_layout_get_type(). (???)

        * gdk/tmpl/general.sgml: Use <envar>, not <envvar>.

        * gdk-pixbuf-io.c, gdk-pixbuf-animation.c, gdk-pixbuf-data.c,
        gdk-pixbuf-loader.c, gdk-pixbuf-scale.c, gdk-pixbuf-util.c,
        gdk-pixdata.c: Markup fixes.

diff --git a/docs/reference/gdk-pixbuf/tmpl/creating.sgml b/docs/reference/gdk-pixbuf/tmpl/creating.sgml
index 818aa9eb4b11d861f696667e02e51c4fbecbcdd7..7c8da80e7d128fbcb10ab4bafe4eb465eff3dc8a 100644 (file)
--- a/docs/reference/gdk-pixbuf/tmpl/creating.sgml
+++ b/docs/reference/gdk-pixbuf/tmpl/creating.sgml
@@ -13,17 +13,17 @@ Creating a pixbuf from image data that is already in memory.
     data buffer needs to be freed; this will happen when a #GdkPixbuf
     is finalized by the reference counting functions If you have a
     chunk of static data compiled into your application, you can pass
-    in #NULL as the destroy notification function so that the data
+    in %NULL as the destroy notification function so that the data
     will not be freed.
   </para>
 
   <para>
     The gdk_pixbuf_new() function can be used as a convenience to
     create a pixbuf with an empty buffer.  This is equivalent to
-    allocating a data buffer using malloc() and then wrapping it with
-    gdk_pixbuf_new_from_data().  The gdk_pixbuf_new() function will
-    compute an optimal rowstride so that rendering can be performed
-    with an efficient algorithm.
+    allocating a data buffer using <function>malloc()</function> and 
+    then wrapping it with gdk_pixbuf_new_from_data().  The gdk_pixbuf_new() 
+    function will compute an optimal rowstride so that rendering can be 
+    performed with an efficient algorithm.
   </para>
 
   <para>